Real-Valued Schemata Search Using Statistical Confidence
نویسندگان
چکیده
2 Neural Network & Machine Learning Laboratory Computer Science Department Brigham Young University Provo, UT 84602, USA E-mail: [email protected] WWW: http://axon.cs.byu.edu Abstract. Many neural network models must be trained by finding a set of real-valued weights that yield high accuracy on a training set. Other learning models require weights on input attributes that yield high leave-one-out classification accuracy in order to avoid problems associated with irrelevant attributes and high dimensionality. In addition, there are a variety of general problems for which a set of real values must be found which maximize some evaluation function. This paper presents an algorithm for doing a schemata search over a real-valued weight space to find a set of weights (or other real values) that yield high values for a given evaluation function. The algorithm, called the Real-Valued Schemata Search (RVSS), uses the BRACE statistical technique [Moore & Lee, 1993] to determine when to narrow the search space. This paper details the RVSS approach and gives initial empirical results.
منابع مشابه
A Study of Improving the Performance of Mining Multi-Valued and Multi-Labeled Data
Nowadays data mining algorithms are successfully applying to analyze the real data in our life to provide useful suggestion. Since some available real data is multi-valued and multi-labeled, researchers have focused their attention on developing approaches to mine multi-valued and multilabeled data in recent years. Unfortunately, there are no algorithms can discretize multi-valued and multi-lab...
متن کاملReal-valued All-Dimensions Search: Low-overhead Rapid Searching over Subsets of Attributes
This paper is about searching the combina torial space of contingency tables during the inner loop of a nonlinear statistical optimiza tion. Examples of this operation in various data analytic communities include search ing for nonlinear combinations of attributes that contribute significantly to a regression (Statistics), searching for items to include in a decision list (machine learning) ...
متن کاملActive Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics
In this paper we advance the line of research launched by Knuth which was later improved by Chen for predicting the size of the search tree expanded by heuristic search algorithms such as IDA*. Chen’s Stratified Sampling (SS) uses a partition of the nodes in the search tree called type system to guide its sampling. Recent work has shown that SS using type systems based on integer-valued heurist...
متن کاملStatistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm
This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...
متن کاملStatistical Convergence of Double Sequences of Real-Valued Functions
In this study, we introduce the notion of pointwise and uniform statistical convergence of double sequences of real-valued functions. We also give the relations between these convergences and pointwise,uniform convergence. Furthermore, we introduce the concept of statistically Cauchy sequence and study statistical analogue of convergence and Cauchy criterion for double sequences of real-valued ...
متن کامل